<HTML><HEAD><TITLE>library(max_flow_eplex)</TITLE></HEAD><BODY>
[ <A HREF="../../index.html">Reference Manual</A> | <A HREF="../../fullindex.html">Alphabetic Index</A> ]<H1>library(max_flow_eplex)</H1>
Linear programming solution for maximum flow problem
<H2>Predicates</H2>
<BLOCKQUOTE>
<DL>
<DT><A HREF="max_flow_eplex-5.html"><STRONG>max_flow_eplex(+Graph, +CapacityArg, +SourceNode, +SinkNode, -MaxFlowValue)</STRONG></A></DT>
<DD>Linear programming solution for maximum flow problem</DD>
<DT><A HREF="max_flow_eplex_dual-5.html"><STRONG>max_flow_eplex_dual(+Graph, +CapacityArg, +SourceNode, +SinkNode, -MaxFlowValue)</STRONG></A></DT>
<DD>Linear programming solution for maximum flow problem, dual linear program</DD>
<DT><A HREF="max_flow_eplex_dual-7.html"><STRONG>max_flow_eplex_dual(+Graph, +CapacityArg, +SourceNode, +SinkNode, -MaxFlowValue, -MinCutNodes, -MinCutEdges)</STRONG></A></DT>
<DD>Linear programming solution for maximum flow problem, dual linear program. Outputs the cut as nodes and edges.</DD>
</DL>
</BLOCKQUOTE>
<H2>About</H2><UL COMPACT>
<LI><STRONG>Status: </STRONG>prototype
<LI><STRONG>Author: </STRONG>CrossCore Optimization Ltd
<LI><STRONG>Copyright &copy; </STRONG>2007, CrossCore Optimization Ltd
<LI><STRONG>Date: </STRONG>2006-2007
</UL>
<HR>Generated from max_flow_eplex.eci on 2009-05-27 01:25
</BODY></HTML>
